Fast Gibbs sampling for high-dimensional Bayesian inversion
نویسندگان
چکیده
منابع مشابه
Fast Gibbs sampling for high-dimensional Bayesian inversion
Solving ill-posed inverse problems by Bayesian inference has recently attracted considerable attention. Compared to deterministic approaches, the probabilistic representation of the solution by the posterior distribution can be exploited to explore and quantify its uncertainties. In applications where the inverse solution is subject to further analysis procedures can be a significant advantage....
متن کاملBayesian inference of genetic parameters for reproductive traits in Sistani native cows using Gibbs sampling
This study was undertaken to estimate the genetic parameters for some reproduction traits in Sistani beef cattle. The data set consisted of 1489 records of number of insemination, calving, and insemination dates in different calving was used. Reproduction traits including calving interval (CI), gestation length (GL), days open (DO), calving to first service (CTFS), first service to conception (...
متن کاملFast Parallel SAME Gibbs Sampling on General Discrete Bayesian Networks
A fundamental task in machine learning and related fields is to perform inference on Bayesian networks. Since exact inference takes exponential time in general, a variety of approximate methods are used. Gibbs sampling is one of the most accurate approaches and provides unbiased samples from the posterior but it has historically been too expensive for large models. In this paper, we present an ...
متن کاملClone MCMC: Parallel High-Dimensional Gaussian Gibbs Sampling
We propose a generalized Gibbs sampler algorithm for obtaining samples approximately distributed from a high-dimensional Gaussian distribution. Similarly to Hogwild methods, our approach does not target the original Gaussian distribution of interest, but an approximation to it. Contrary to Hogwild methods, a single parameter allows us to trade bias for variance. We show empirically that our met...
متن کاملBayesian Service Demand Estimation with Gibbs Sampling
Performance modelling of web applications involves the task of estimating service demands of requests at physical resources, such as CPUs. In this paper, we propose a service demand estimation algorithm based on a Markov Chain Monte Carlo (MCMC) technique, Gibbs sampling. Our methodology is widely applicable as it requires only queue length samples at each resource, which are simple to measure....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inverse Problems
سال: 2016
ISSN: 0266-5611,1361-6420
DOI: 10.1088/0266-5611/32/11/115019